Synchronous Load Balancing in Hypercube Multicomputers with Faulty Nodes
نویسندگان
چکیده
This paper presents a new dynamic load-balancing algorithm for hypercube multicomputers with faulty nodes. The emphasis in our method is on obtaining global load information and performing task migration using ``short paths'' in a synchronous manner so that a minimal amount of communication overhead is required. To accomplish this, we present an algorithm for constructing a new logical topology from a hypercube topology with faulty nodes. This new topology is used to obtain the global load information and to perform task migration. Simulation results are used to evaluate the performance of our dynamic load balancing method when compared with previous methods. 1999 Academic Press
منابع مشابه
An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers
This paper presents an improved direct dimension exchange method (DDE) for synchronous load balancing for k-ary n-cube multicom-puters. The new method is based on the improved DEM for hypercube. The original DEM when extended to the k-ary n-cube requires many iterations in exchanging loads between neighboring nodes to converge to a balanced state. The original DDE does not requires iteratively ...
متن کاملA Network Flow Model for Load Balancing in Circuit-Switched Multicomputers
In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention-the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks...
متن کاملAdaptive Fault-Tolerant Routing in Hypercube Multicomputers
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node in an injured hypcrcube, the information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. We propose first a distributed adaptive fault-tolerant routing scheme for ...
متن کاملThe Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that share...
متن کاملActive Pixel Merging on Hypercube Multicomputers
This paper presents algorithms developed for pixel merging phase of object space parallel polygon rendering on hypercube connected multicomputers These algorithms reduce volume of communication in pixel merging phase by only exchanging local foremost pixels In order to avoid message fragmentation local foremost pixels should be stored in consecutive memory locations An algorithm called modi ed ...
متن کامل